Graph Layout Adjustment Strategies

نویسندگان

  • Margaret-Anne D. Storey
  • Hausi A. Müller
چکیده

Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. A layout adjustment algorithm which can be used to create sheye views of nested graphs is introduced. The SHriMP (SimpleHierarchicalMulti-Perspective) visualization technique uses this algorithm to create sheye views of nested graphs. This algorithm preserves straightness of lines and uniformly resizes nodes when requests for more screen space are made. In contrast to other layout adjustment algorithms, this algorithm has several variants to preserve additional selected properties of the original graph. These variants use di erent layout strategies to reposition nodes when the graph is distorted. The SHriMP visualization technique is demonstrated through its application to visualizing structures in large software systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs, They Are Changing Dynamic Graph Drawing for a Sequence of Graphs

In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We in...

متن کامل

Algorithms for Cluster Busting in Anchored Graph Drawing

Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maintain a user’s mental picture of the original layout. We present a new approach to layout adjustment called cluster busting in anchored graph drawing. We then give two algorithms as examples of this approach. The goals o...

متن کامل

Customizing a Fisheye View Algorithm to Preserve the Mental Map

Frequently large knowledge bases are represented by graphs. Many visualization tools allow users or other applications to interact with and adjust the layouts of these graphs. One layout adjustment problem is that of showing more detail without eliding parts of the graph. Approaches based on a sheye lens paradigm seem well suited to this task. However, many of these techniques are non-trivial t...

متن کامل

Multi-circular Layout of Micro/Macro Graphs

We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced by a given partition of the micro-level vertices. A typical example is a social network of employees organized into different departments. We do not impose restrictions on the macro-level layout other than sufficient t...

متن کامل

Graph Drawing in Motion II

Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. Whenever a layout in a graph drawing system is modified, the mental map of the user must be preserved. One way in which the user can be helped in understanding a change of layout is through animation of the change. In this paper, we present clustering-based strateg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995